Threshold Values for Processing Distributed Queries
نویسندگان
چکیده
منابع مشابه
Deterministic Threshold Queries of Distributed Data Structures
Convergent replicated data types, or CvRDTs, are latticebased data structures for enforcing the eventual consistency of replicated objects in a distributed system. Although CvRDTs are provably eventually consistent, queries of CvRDTs nevertheless allow inconsistent intermediate states of replicas to be observed; and although in practice, many systems allow a mix of eventually consistent and str...
متن کاملDistributed Processing of Conjunctive Queries
We distinguish that Web query processing is composed of two phases: (a) retrieving information on documents related to the queries and ranking them, and (b) generating snippets, title, and URL information for the answer page. Using real data and a small cluster of index servers, we study four basic and key issues related to this first phase of query processing: load balance, broker behavior, pe...
متن کاملEfficient Processing of Distributed Top-k Queries
Ranking-aware queries, or top-k queries, have received much attention recently in various contexts such as web, multimedia retrieval, relational databases, and distributed systems. Top-k queries play a critical role in many decision-making related activities such as, identifying interesting objects, network monitoring, load balancing, etc. In this paper, we study the ranking aggregation problem...
متن کاملTowards distributed processing of RDF path queries
A technical infrastructure for storing, querying and managing RDF data is a key element in the current Semantic Web development. Systems like Jena, Sesame or the ICS-FORTH RDF Suite are widely used for building Semantic Web applications. Currently, none of these systems support the integrated querying of distributed RDF repositories. We consider this a major shortcoming since the Semantic Web i...
متن کاملDistributed Processing of XPath Queries Using MapReduce
In this paper we investigate the problem of efficiently evaluating XPath queries over large XML data stored in a distributed manner. We propose a MapReduce algorithm based on a query decomposition which computes all expected answers in one MapReduce step. The algorithm can be applied over large XML data which is given either as a single distributed document or as a collection of small XML docum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1991
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/34.6.551